Extracting N-ary Relationships Through Database Reverse Engineering
نویسنده
چکیده
This paper presents an automatic process for reverse engineering the n-ary relationship tables from an operating relational database. This process performs the extraction of cardinality ratios by generating a set of SQL queries for each n-ary relationship table. We focus on realistic assumptions. We suppose that there are no constraints on the uniqueness of the key attribute names and the dependencies are not supposed to be known a priori. A PRO*C program has been implemented, it enables us to automatically build SQL queries via dynamic SQL. We also study the influence of the number of key attributes and the number of tuples upon the performance of our process.
منابع مشابه
Inference of Aggregate Relationships through Database Reverse Engineering
This paper presents a process to improve the reverse engineering of relational databases. Our process extracts the current aggregate relationships from a relational database through a combination of data dictionary, data schema and data instance analysis. The process we propose can refine conceptual diagrams of commercial tools with reverse engineering options as Power AMC (Sybase), Designer (O...
متن کاملExtracting an Entity Relationship Schema from a Relational Database through Reverse Engineering
This paper presents a method for extracting a conceptual schema from a relational database. The method is based on an analysis of data manipulation statements in the code of an application using a relational DBMS. Attributes representing references between tables in the relational schema, and possible keys are determined by an analysis of join conditions in queries and view deenitions. Knowledg...
متن کاملParallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملN-ary Relationships, What a Mess
The transformation from n-ary relationships to a relational database schema has never been really fully analyzed. This paper presents one of the several ternary cases ignored by the ER-to-RM literature. The case shows that the following common belief is wrong: Given a set of FDs over a table resulting in a non-3NF situation, it is always possible to obtain a fully equivalent set of 3NF tables, ...
متن کاملInterval-Based Conceptual Models for Time-Dependent Multimedia Data
Multimedia data often have time dependencies that must be satisfied at presentation time. To support a general-purpose multimedia information system, these timing relationships must be managed to provide utility to both the data presentation system and the multimedia author. In this paper we propose new conceptual models for capturing these timing relationships and managing them as part of a da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996